The learnability of description logics with equality constraints
نویسندگان
چکیده
منابع مشابه
On C-Learnability in Description Logics
We prove that any concept in any description logic that extendsALC with some features amongst I (inverse),Qk (quantified number restrictions with numbers bounded by a constant k), Self (local reflexivity of a role) can be learnt if the training information system is good enough. That is, there exists a learning algorithm such that, for every concept C of those logics, there exists a training in...
متن کاملApplications and Extensions of PTIME Description Logics with Functional Constraints
We review and extend earlier work on the logic CFD, a description logic that allows terminological cycles with universal restrictions over functional roles. In particular, we consider the problem of reasoning about concept subsumption and the problem of computing certain answers for a family of attribute-connected conjunctive queries, showing that both problems are in PTIME. We then consider th...
متن کاملPath-Based Identification Constraints in Description Logics
In spite of the importance of identification mechanisms in ontology engineering, the Description Logics at the basis of current reasoners do not include modeling features for expressing identification constraints. In this paper, we consider a powerful class of identification constraints, which allow for using roles, inverses, and paths, thus capturing sophisticated forms of identifications ofte...
متن کاملthe description of verb phrase of dezfuli dialect
شهرستان دزفول در بخش شمالغربی خوزستان با مساحت 4700 کیلومتر مربع و جمعیت 380416 (1375 ) واقع شده است . دزفولیها به گویش دزفولی تکلم می کنند ، گویشی که جز دسته جنوبی زبانهای ایرانی است . در این پایان نامه نویسنده قصد دارد گروه فعلی گویش دزفولی را توصیف کند. همچنین به بحث در باره ریشه فعلی و ستاک های مختلف ، ساخت سببی ، فعل های منظم و نامنظم ، ویژگیهای فعل مانند زمان ، وجه و نمود می پردازد در فصل...
Equality-Friendly Well-Founded Semantics and Applications to Description Logics
We tackle the problem of defining a well-founded semantics for Datalog rules with existentially quantified variables in their heads and negations in their bodies. In particular, we provide a well-founded semantics (WFS) for the recent Datalog± family of ontology languages, which covers several important description logics (DLs). To do so, we generalize Datalog± by non-stratified nonmonotonic ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 1994
ISSN: 0885-6125,1573-0565
DOI: 10.1007/bf00993470